Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
271	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ Joondong Kim∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:57 NP-complete problems Steiner tree problem Minimum spanning tree Eulerian path Matching Graph coloring Tree Connectivity Matroid theory Graph theory Mathematics Theoretical computer science
272	Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Planar graphs Feedback vertex set Forbidden graph characterization Permutation graph Tree Graph Graph theory Graph operations Path decomposition
273	A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: www.mit.edu Language: English - Date: 2012-07-29 14:44:15 NP-complete problems Matroid theory Spanning tree Signed graph Graph Clique Tree Combinatorial optimization Eulerian path Graph theory Theoretical computer science Mathematics
274	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Planar Path Transformation Selim G. Akl Md. Kamrul Islam Add to Reading List Source URL: cccg.ca Language: English - Date: 2006-06-29 12:05:03 Geometry Planar graphs Hamiltonian path Pseudotriangle Delaunay triangulation Graph theory Mathematics Triangulation
275	Non-Stretchable Pseudo-Visibility Graphs Ileana Streinu Dept. of Computer Science, Smith College, Northampton, MA 01063, USA. Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 15:59:40 Visibility graph Bipartite graph Matroid theory Path decomposition Intersection graph Graph theory Graph Planar graph
276	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:19 NP-complete problems Combinatorial optimization Graph connectivity Matching Steiner tree problem Minimum spanning tree Eulerian path Route inspection problem Cut Graph theory Theoretical computer science Mathematics
277	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Carambolas Maarten L¨ offler∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:58 Discrete geometry Euclidean plane geometry Monotone polygon Line graph Graph Tree Hamiltonian path Neighbourhood Path Graph theory Mathematics Arrangement of lines
278	ICS 260 – Fall 2001 – First Midterm Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-10-18 19:06:29 Network flow Maximum flow problem Flow network Matching Shortest path problem Distance Circulation problem Graph Breadth-first search Graph theory Mathematics Theoretical computer science
279	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Minimum Dilation Triangulation: Reaching Optimality Efficiently Al´ex F. Brandt∗ Miguel M. Gaiowski∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 16:02:46 Graph theory Delaunay triangulation Linear programming Geometric spanner Shortest path problem Pitteway triangulation Jump-and-Walk algorithm Triangulation Mathematics Geometry
280	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science